Primitive Prime Divisors in Zero Orbits of Polynomials
نویسندگان
چکیده
منابع مشابه
Primitive Prime Divisors in Zero Orbits of Polynomials
Let (bn) = (b1, b2, . . . ) be a sequence of integers. A primitive prime divisor of a term bk is a prime which divides bk but does not divide any of the previous terms of the sequence. A zero orbit of a polynomial φ(z) is a sequence of integers (cn) where the n-th term is the n-th iterate of φ at 0. We consider primitive prime divisors of zero orbits of polynomials. In this note, we show that f...
متن کاملPrimitive Prime Divisors in Polynomial Arithmetic Dynamics
The question of which terms of a recurrence sequence fail to have primitive prime divisors has been significantly studied for several classes of linear recurrence sequences and for elliptic divisibility sequences. In this paper, we consider the question for sequences generated by the iteration of a polynomial. For two classes of polynomials f(x) ∈ Z[x] and initial values a1 ∈ Z, we show that th...
متن کاملABC implies primitive prime divisors in arithmetic dynamics
Let K be a number field, let φ(x) ∈ K(x) be a rational function of degree d > 1, and let α ∈ K be a wandering point such that φ(α) = 0 for all n > 0. We prove that if the abc-conjecture holds for K, then for all but finitely many positive integers n, there is a prime p of K such that vp(φ (α)) > 0 and vp(φ (α)) 0 for all positive integers m < n. Under appropriate ramification hypotheses, we can...
متن کاملPrimitive Prime Divisors of First-Order Polynomial Recurrence Sequences
The question of which terms of a recurrence sequence fail to have primitive prime divisors has been significantly studied for several classes of linear recurrence sequences and for elliptic divisibility sequences. In this paper, we consider the question for sequences generated by the iteration of a polynomial. For two classes of polynomials f(x) ∈ Z[x] and initial values a1 ∈ Z, we show that th...
متن کاملPrime divisors of palindromes
Abstract In this paper, we study some divisibility properties of palindromic numbers in a fixed base g ≥ 2. In particular, if PL denotes the set of palindromes with precisely L digits, we show that for any sufficiently large value of L there exists a palindrome n ∈ PL with at least (log log n)1+o(1) distinct prime divisors, and there exists a palindrome n ∈ PL with a prime factor of size at lea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Integers
سال: 2012
ISSN: 1867-0652,1867-0652
DOI: 10.1515/integers-2011-0117